As elaborated on in section~\ref{sec:analysis_of_results}, the success criteria in \ref{sec:requirements} have been satisfied given the assumption that all nodes in a system are uniform. Tagapastry achieves a considerable degree of storage distribution with an acceptable increase search latency and bandwidth. In the future, we intend to test Tagapastry on a real network comprising heterogeneous machines to confirm its viability. 

Section \ref{sec:futurework} proposes various optimizations and extensions. Among them, the most important are security (\ref{sec:future_security}), handling of bottlenecks (\ref{sec:bottlenecks}) and handling boundary cases (\ref{sec:fw-boundarycases}). Moreover, the more efficient expansion algorithm proposed in section \ref{sec:eff_dist_alg} should be adapted.
